Private membership test protocol with low communication complexity
نویسندگان
چکیده
منابع مشابه
Private Membership Test Protocol with Low Communication Complexity
Conclusion: Homomorphic encryption allows server to search in the matrix without knowledge of client’s keys. The proposed protocol has significantly smaller communication complexity than prior art. Protocol: Our protocol is based on a real world scenario. A server possesses 2 malware samples and stores their hash values in 16 different subsets, based on the first 4 bits of the hash value. E...
متن کاملPrivate Revocation Test using Oblivious Membership Evaluation Protocol
This paper presents a cryptographic protocol for the authenticated dictionary, namely, an untrusted directory provides a verifiable answer to a membership query for a given element. In our protocol, a user is able to retrieve whether or not a target element belongs to a database that the directory has without revealing which element he/she wishes to know against the untrusted directory. Our pro...
متن کاملA Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation
We present a secure multiparty computation (SMC) protocol for obliviously reading an element of an array, achieving constant online communication complexity. While the total complexity of the protocol is linear in the size of the array, the bulk of it is pushed into the offline precomputation phase, which is independent of the array and the index of the element. Although private lookup is less ...
متن کاملQuantum Private Information Retrieval with Sublinear Communication Complexity
This note presents a quantum protocol for private information retrieval, in the case of a single (honest) server and with information-theoretical privacy, that has O( √ n)qubit communication complexity, where n denotes the size of the database. In comparison, it is known that any classical protocol must use Ω(n) bits of communication in this setting. ACM Classification: F.2.3 AMS Classification...
متن کاملA Fast Single Server Private Information Retrieval Protocol with Low Communication Cost
Existing single server Private Information Retrieval (PIR) protocols are far from practical. To be practical, a single server PIR protocol has to be both communicationally and computationally efficient. In this paper, we present a single server PIR protocol that has low communication cost and is much faster than existing protocols. A major building block of the PIR protocol in this paper is a t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital Communications and Networks
سال: 2020
ISSN: 2352-8648
DOI: 10.1016/j.dcan.2019.05.002